By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Optimization

ALERT ATTENTION: System maintenance will be performed the weekend of Saturday, March 28, 2009. This event will begin at 6:00 am on March 28 and will conclude at approximately 12:00 noon on Sunday March 29 (all times EDT). Some Scitation services may be affected during this period.

Table of Contents
Volume 4, Issue 2, pp. 229-453

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Line Search Procedures for the Logarithmic Barrier Function

Walter Murray and Margaret H. Wright

pp. 229-246

Superlinearly Convergent $O ( \sqrt{n} L )$-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem

Kevin McShane

pp. 247-261

Convergence Properties of a Class of Rank-two Updates

Paul T. Boggs and Jon W. Tolle

pp. 262-287

Can Parallel Branch and Bound without Communication Be Effective?

Per S. Laursen

pp. 288-296

Convergence Theory of Nonlinear Newton–Krylov Algorithms

Peter N. Brown and Youcef Saad

pp. 297-330

On the Resolution of Linearly Constrained Convex Minimization Problems

Ana Friedlander, José Mario Martínez, and Sandra A. Santos

pp. 331-339

On Optimization Problems with Variational Inequality Constraints

Jirí V. Outrata

pp. 340-357

Triangular Decomposition Methods for Solving Reducible Nonlinear Systems of Equations

J. E. Dennis, Jr., José Mario Martínez, and Xiaodong Zhang

pp. 358-382

Extension of Hoffman's Error Bound to Polynomial Systems

Xiao-Dong Luo and Zhi-Quan Luo

pp. 383-392

Globally Convergent Inexact Newton Methods

Stanley C. Eisenstat and Homer F. Walker

pp. 393-422

An Interior Point Column Generation Method for Linear Programming Using Shifted Barriers

John E. Mitchell

pp. 423-440

Predictor-corrector Methods for a Class of Linear Complementarity Problems

Sanjay Mehrotra and Robert A. Stubbs

pp. 441-453